Regularization of Discrete Ill-Posed Problems

The paper concerns conditioning aspects of finite-dimensional problems arising when the Tikhonov regularization is applied to discrete ill-posed problems. A relation between the regularization parameter and the sensitivity of the regularized solution is investigated. The main conclusion is that the condition number can be decreased only to the square root of that for the nonregularized problem. The convergence of solutions of regularized discrete problems to the exact generalized solution is analyzed just in the case when the regularization corresponds to the minimal condition number. The convergence theorem is proved under the assumption of the suitable relation between the discretization level and the data error. As an example the method of truncated singular value decomposition with regularization is considered. This revised version was published online in July 2006 with corrections to the Cover Date.     

The semi‐iterative method applied to the hyper‐power iteration

The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd.     

电子束驱动的回旋激射不稳定性

对弱相对论性电子束驱动的回旋激射(maser)不稳定性的一般理论作了详细讨论.对在获得增长率实用表达式过程中若干解析表达式的推导与细节做了仔细的补充讨论和说明，还增加了增长率的近似表达式，并由此得到了回旋激射不稳定性主要特征的解析分析以及与精确计算的比较，使整个理论有一个完整的描述.侧重解析讨论，也提供了部分一般性的数值计算结果. 关键词： 回旋激射不稳定性 弱相对论性电子束 增长率     

Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions

We consider the problem of minimizing an SC¹ function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.     

A novel tridentate nitrogen donor as ligand in copper catalyzed ATRP of methyl methacrylate

A tridentate ligand, BPIEP: 2,6‐bis[1‐(2,6‐diisopropyl phenylimino) ethyl] pyridine, having central pyridine unit and two peripheral imine coordination sites was effectively employed in controlled/“living” radical polymerization of MMA at 90°C in toluene as solvent, Cu^IBr as catalyst, and ethyl‐2‐bromoisobutyrate (EBiB) as initiator resulting in well‐defined polymers with polydispersities M_w/M_n ≤ 1.23. The rate of polymerization follows first‐order kinetics, k_app = 3.4 × 10^?5 s^?1, indicating the presence of low radical concentration ([P*] ≤ 10^?8) throughout the reaction. The polymerization rate attains a maximum at a ligand‐to‐metal ratio of 2:1 in toluene at 90°C. The solvent concentration (v/v, with respect to monomer) has a significant effect on the polymerization kinetics. The polymerization is faster in polar solvents like, diphenylether, and anisole, as compared to toluene. Increasing the monomer concentration in toluene resulted in a better control of polymerization. The molecular weights (M_n,SEC) increased linearly with conversion and were found to be higher than predicted molecular (M_n,Cal). However, the polydispersity remained narrow, i.e., ≤1.23. The initiator efficiency at lower monomer concentration approaches a value of 0.7 in 110 min as compared to 0.5 in 330 min at higher monomer concentration. The aging of the copper salt complexed with BPIEP had a beneficial effect and resulted in polymers with narrow polydispersitities and higher conversion. PMMA obtained at room temperature in toluene (33%, v/v) gave PDI of 1.22 (M_n = 8500) in 48 h whereas, at 50°C the PDI is 1.18 (M_n = 10,300), which is achieved in 23 h. The plot of lnk_app versus 1/T gave an apparent activation energy of polymerization as (ΔE^≠_app) 58.29 KJ/mol and enthalpy of equilibrium (ΔH⁰_eq) to 28.8 KJ/mol. Reverse ATRP of MMA was successfully performed using AIBN in bulk as well as solution. The controlled nature of the polymerization reaction was established through kinetic studies and chain extension experiments. © 2005 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 43: 4996–5008, 2005     

Development of the mechanics of underground and special structures in Kazakhstan over the last 40 years

Some results on underground structures obtained by Kazakh mechanicians are reviewed. The review covers a period of the last forty years. Also results on the mechanics of special objects are discussed.Translated from Prikladnaya Mekhanika, Vol. 40, No. 10, pp. 3–36, October 2004.     

带惩罚项与随机输入的BP神经网络在线梯度学习算法的收敛性

本文对三层BP神经网络中带有惩罚项的在线梯度学习算法的收敛性问题进行了研究,在网络训练每一轮开始执行之前,对训练样本随机进行重排,以使网络学习更容易跳出局部极小,文中给出了误差函数的单调性定理以及该算法的弱收敛和强收敛性定理。     

Smoothing estimation of rate function for recurrent event data with informative censoring

This paper proposes kernel estimation of the occurrence rate function for recurrent event data with informative censoring. An informative censoring model is considered with assumptions made on the joint distribution of the recurrent event process and the censoring time without modeling the censoring distribution. Under the validity of the informative censoring model, we also show that an estimator based on the assumption of independent censoring becomes inappropriate and is generally asymptotically biased. To investigate the asymptotic properties of the proposed estimator, the explicit form of its asymptotic mean squared risk and the asymptotic normality are derived. Meanwhile, the empirical consistent smoothing estimator for the variance function of the estimator is suggested. The performance of the estimators are also studied through Monte Carlo simulations. An epidemiological example of intravenous drug user data is used to show the influence of informative censoring in the estimation of the occurrence rate functions for inpatient cares over time.     

Bounds to optimal burn‐in and optimal work size

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd.     

ON THE RATE OF WEIGHTED Lp CONVERGENCE BY THE GRUENWALD INTERPOLATORY OPERATORS

This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1.